Packet error rates of terminated and tailbiting convolutional codes
نویسندگان
چکیده
When a convolutional code is used to provide forward error correction for packet data transmission, the standard performance measures of convolutional codes, i.e., bit error rate and first-event error rate, become less useful. Instead we are interested in the average probability of block (or packet) error. In this paper a modified transfer function approach is used to obtain a union bound on the block error rate of terminated and tailbiting convolutional codes. The performance of these block codes obtained from termination and tailbiting is compared to the performance of some standard block codes for various information block lengths and also compared to the sphere packing lower bound for optimal block codes. The conclusion is that block codes derived from convolutional codes form a competitive class of short block length block codes. Keywords— convolutional code, block code, block error probability, packet error probability, union bound, terminated convolutional code, tailbiting convolutional code, sphere packing bound
منابع مشابه
Error-Trellis Construction for Tailbiting Convolutional Codes
Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction ...
متن کاملHybrid Type-II ARQ Schemes based on Convolutional Codes in Wireless Channels
|In this work we studied the performance of the hybrid type-II Automatic Repeat reQuest (ARQ) system on Rayleigh fading channels. This system is based on High Rate Optimized Rate Compatible Punctured Convolutional (HRO-RCPC) codes combined with simple repetition codes. The performance is investigated for di erent packet sizes and constraint lengths of the convolutional encoder. Additionally the...
متن کاملConvolutional Coding and Decoding in Hybrid Type-II ARQ Schemes on Wireless Channels
| In this work we studied the performance of the hybrid type-II Automatic Repeat reQuest (ARQ) system on Rayleigh fading channels. This system is based on High Rate Optimized Rate Compatible Punctured Convolutional (HRO-RCPC) codes combined with simple repetition codes. The performance is investigated for diierent packet sizes and constraint lengths of the convolutional encoder. Additionally th...
متن کاملGenetic Algorithm used in Search of good Tailbiting Codes
In a wireless transmission it is necessary to use the channel encoder in order to avoid losses due to transmission errors. This paper presents a method to design the tailbiting codes (TB) for packet data transmission over the additive white gaussian noise (AWGN) channel. In this paper, genetic algorithms (GA) [1] are used in search of good tailbiting codes. The GA technique is applied in search...
متن کاملStudy on methods of the trellis termination of the convolutional codes components of the turbo-codes
This paper makes a comparison in terms of the bit error rate (BER) and frame error rate (FER) versus signal to noise ratio (SNR) between the different methods of the trellis termination of the recursive, systematic, single and double-binary convolutional codes used in turbo-codes. The best four well known termination methods were investigated: circular (tailbiting), single-termination, interlea...
متن کامل